A Note on Off-Line Permutation Routing on a Mesh-Connected Processor Array
نویسنده
چکیده
We show how to off-line route any permutation of a n X n meshconnected processor array in 2.5n 3 steps with at most 6 packets per processor per time step and in 2.25n +3 steps with at most 8 packets per processor per time step.
منابع مشابه
Fast Routing on the Reconfigurable Meshmichael
We consider permutation routing problems on mesh connected processor arrays under a very weak model of reconnguration: we allow only uni-directional row or column buses, point-to-point communication, one-port-at-the-time serve by each processor. We present a scheme which is asympotically optimal for k-permutations, for any arbitrary k > 0. It works optimally on meshes of arbitrary dimensions d,...
متن کاملPermutation Routing and Sorting on the Reconfigurable Mesh
In this paper we demonstrate the power of reconfiguration by presenting efficient randomized algorithms for both packet routing and sorting on a reconfigurable mesh connected computer. The run times of these algorithms are better than the best achievable time bounds on a conventional mesh. Many variations of the reconfigurable mesh can be found in the literature. We define yet another variation...
متن کاملDesign and Implementation of Field Programmable Gate Array Based Baseband Processor for Passive Radio Frequency Identification Tag (TECHNICAL NOTE)
In this paper, an Ultra High Frequency (UHF) base band processor for a passive tag is presented. It proposes a Radio Frequency Identification (RFID) tag digital base band architecture which is compatible with the EPC C C2/ISO18000-6B protocol. Several design approaches such as clock gating technique, clock strobe design and clock management are used. In order to reduce the area Decimal Matrix C...
متن کاملAn Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Mul - Computers, IEEE Transactions on
In this paper we present the multistage off-line method, a new and rather natural way to model off-line packet routing problems, which reduces the problem of off-line packet routing to that of finding edge disjoint paths on a multistage graph. The multistage off-line method can model any kind of routing pattern on any graph and can incorporate the size of the maximum queue allowed in any proces...
متن کاملOptimal Permutation Routing on Mesh Networks
Permutation routing is used as one of the standard tests of routing algorithms. In the permutation routing problem, each processor is the origin of at most one packet and the destination of no more than one packet. The goal is to minimize the number of time steps required to route all packets to their respective destinations. Wireless mesh networks are based on plane tessellations that divide t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991